Explicit bounds on Gamidov type integral

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Explicit Bounds on Some Nonlinear Integral Inequalities

In this paper, some new nonlinear integral inequalities involving functions of one and two independent variables which provide explicit bounds on unknown functions are established. We also present some of its applications to the qualitative study of retarded differential equations.

متن کامل

Explicit Bounds on Some Nonlinear Retarded Integral Inequalities

In this paper some new retarded integral inequalities are established and explicit bounds on the unknown functions are derived. The present results extend some existing ones proved by Lipovan in [A retarded integral inequality and its applications, J. Math. Anal. Appl. 285 (2003) 436-443].

متن کامل

Explicit Bounds to Some New Gronwall-Bellman-Type Delay Integral Inequalities in Two Independent Variables on Time Scales

Some new Gronwall-Bellman-type delay integral inequalities in two independent variables on time scales are established, which provide a handy tool in the research of qualitative and quantitative properties of solutions of delay dynamic equations on time scales. The established inequalities generalize some of the results in the work of Zhang and Meng 2008, Pachpatte 2002, and Ma 2010.

متن کامل

Bounds and Comparisons for Weighted Renewal-Type Integral Equations

In this note, inequalities and bounds for weighted renewal-type integral equations are presented. Some upper and lower bounds for the weighted renewal-type integral equations with monotone weight functions are derived. Some upper and lower bounds for the weighted renewal-type equations with monotone weight functions are derived. Bounds for the difference between two weighted renewal functions a...

متن کامل

Explicit Cost Bounds of Algorithms

We study multivariate tensor product problems in the worst case and average case settings. They are deened on functions of d variables. For arbitrary d, we provide explicit upper bounds on the costs of algorithms which compute an "-approximation to the solution. The cost bounds are of the form (c(d) + 2) 1 2 + 3 ln 1=" d ? 1 4 (d?1) 1 " 5 : Here c(d) is the cost of one function evaluation (or o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Tamkang Journal of Mathematics

سال: 2006

ISSN: 2073-9826,0049-2930

DOI: 10.5556/j.tkjm.37.2006.174